#include <iostream>
#include <unordered_set>
#include <unordered_map>
#include <set>
using namespace std;

void test_set1()
{
	unordered_set<int> s = { 6,1,3,8,2,7 };
	unordered_set<int> ::iterator it = s.begin();
	while (it != s.end())
	{
		cout << *it << " ";
		++it;
	}
	cout << endl;
	for (auto e : s)
	{
		cout << e << " ";
	}
	cout << endl;
}



#include "HashTable.h"

void test_map1()
{
	unordered_map<string, string>dict;
	dict.insert({ "left","左边" });
	dict["sort"];
	dict["sort"] = "排序";

}

int main()
{
	//test_set1();
	//test_map1();

	open_address::TestHT1();
	open_address::TestHT2();
	cout << endl;
	hash_bucket::TestHT1();
	hash_bucket::TestHT2();


	return 0;
}